TSTP Solution File: SET612^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET612^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:54:55 EDT 2024
% Result : Theorem 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 17 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 52 ( 1 equ; 0 cnn)
% Maximal formula atoms : 31 ( 4 avg)
% Number of connectives : 150 ( 34 ~; 31 |; 20 &; 64 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 2 ^ 7 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: a > $o ).
thf(decl_23,type,
epred2_0: a > $o ).
thf(decl_24,type,
epred3_0: a > $o ).
thf(decl_25,type,
esk1_0: a ).
thf(cBOOL_PROP_85_pme,conjecture,
! [X1: a > $o,X2: a > $o,X3: a > $o] :
( ( ^ [X4: a] :
( ( X1 @ X4 )
& ~ ( ( X2 @ X4 )
| ( X3 @ X4 ) ) ) )
= ( ^ [X4: a] :
( ( X1 @ X4 )
& ~ ( X2 @ X4 )
& ( X1 @ X4 )
& ~ ( X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_85_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o,X3: a > $o,X8: a] :
( ( ( X1 @ X8 )
& ~ ( ( X2 @ X8 )
| ( X3 @ X8 ) ) )
<=> ( ( X1 @ X8 )
& ~ ( X2 @ X8 )
& ( X1 @ X8 )
& ~ ( X3 @ X8 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cBOOL_PROP_85_pme])])]) ).
thf(c_0_2,negated_conjecture,
( ( ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
thf(c_0_3,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
epred1_0 @ esk1_0,
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_9,negated_conjecture,
~ ( epred2_0 @ esk1_0 ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
~ ( epred3_0 @ esk1_0 ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET612^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 13:23:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running higher-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48 # Version: 3.1.0-ho
% 0.21/0.48 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.21/0.48 # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.48 # Starting sh5l with 300s (1) cores
% 0.21/0.48 # post_as_ho10 with pid 22622 completed with status 0
% 0.21/0.48 # Result found by post_as_ho10
% 0.21/0.48 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.21/0.48 # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.48 # No SInE strategy applied
% 0.21/0.48 # Search class: HGHNF-FFSF00-SSSFFFNN
% 0.21/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting sh3 with 163s (1) cores
% 0.21/0.48 # sh3 with pid 22630 completed with status 0
% 0.21/0.48 # Result found by sh3
% 0.21/0.48 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.21/0.48 # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.48 # No SInE strategy applied
% 0.21/0.48 # Search class: HGHNF-FFSF00-SSSFFFNN
% 0.21/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting sh3 with 163s (1) cores
% 0.21/0.48 # Preprocessing time : 0.001 s
% 0.21/0.48 # Presaturation interreduction done
% 0.21/0.48
% 0.21/0.48 # Proof found!
% 0.21/0.48 # SZS status Theorem
% 0.21/0.48 # SZS output start CNFRefutation
% See solution above
% 0.21/0.48 # Parsed axioms : 2
% 0.21/0.48 # Removed by relevancy pruning/SinE : 0
% 0.21/0.48 # Initial clauses : 14
% 0.21/0.48 # Removed in clause preprocessing : 1
% 0.21/0.48 # Initial clauses in saturation : 13
% 0.21/0.48 # Processed clauses : 13
% 0.21/0.48 # ...of these trivial : 7
% 0.21/0.48 # ...subsumed : 2
% 0.21/0.48 # ...remaining for further processing : 3
% 0.21/0.48 # Other redundant clauses eliminated : 0
% 0.21/0.48 # Clauses deleted for lack of memory : 0
% 0.21/0.48 # Backward-subsumed : 0
% 0.21/0.48 # Backward-rewritten : 0
% 0.21/0.48 # Generated clauses : 0
% 0.21/0.48 # ...of the previous two non-redundant : 0
% 0.21/0.48 # ...aggressively subsumed : 0
% 0.21/0.48 # Contextual simplify-reflections : 0
% 0.21/0.48 # Paramodulations : 0
% 0.21/0.48 # Factorizations : 0
% 0.21/0.48 # NegExts : 0
% 0.21/0.48 # Equation resolutions : 0
% 0.21/0.48 # Disequality decompositions : 0
% 0.21/0.48 # Total rewrite steps : 8
% 0.21/0.48 # ...of those cached : 7
% 0.21/0.48 # Propositional unsat checks : 0
% 0.21/0.48 # Propositional check models : 0
% 0.21/0.48 # Propositional check unsatisfiable : 0
% 0.21/0.48 # Propositional clauses : 0
% 0.21/0.48 # Propositional clauses after purity: 0
% 0.21/0.48 # Propositional unsat core size : 0
% 0.21/0.48 # Propositional preprocessing time : 0.000
% 0.21/0.48 # Propositional encoding time : 0.000
% 0.21/0.48 # Propositional solver time : 0.000
% 0.21/0.48 # Success case prop preproc time : 0.000
% 0.21/0.48 # Success case prop encoding time : 0.000
% 0.21/0.48 # Success case prop solver time : 0.000
% 0.21/0.48 # Current number of processed clauses : 3
% 0.21/0.48 # Positive orientable unit clauses : 1
% 0.21/0.48 # Positive unorientable unit clauses: 0
% 0.21/0.48 # Negative unit clauses : 2
% 0.21/0.48 # Non-unit-clauses : 0
% 0.21/0.48 # Current number of unprocessed clauses: 0
% 0.21/0.48 # ...number of literals in the above : 0
% 0.21/0.48 # Current number of archived formulas : 0
% 0.21/0.48 # Current number of archived clauses : 0
% 0.21/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.48 # Non-unit clause-clause subsumptions : 0
% 0.21/0.48 # Unit Clause-clause subsumption calls : 0
% 0.21/0.48 # Rewrite failures with RHS unbound : 0
% 0.21/0.48 # BW rewrite match attempts : 0
% 0.21/0.48 # BW rewrite match successes : 0
% 0.21/0.48 # Condensation attempts : 0
% 0.21/0.48 # Condensation successes : 0
% 0.21/0.48 # Termbank termtop insertions : 735
% 0.21/0.48 # Search garbage collected termcells : 216
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.003 s
% 0.21/0.48 # System time : 0.001 s
% 0.21/0.48 # Total time : 0.004 s
% 0.21/0.48 # Maximum resident set size: 1748 pages
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.004 s
% 0.21/0.48 # System time : 0.002 s
% 0.21/0.48 # Total time : 0.006 s
% 0.21/0.48 # Maximum resident set size: 1716 pages
% 0.21/0.48 % E---3.1 exiting
% 0.21/0.48 % E exiting
%------------------------------------------------------------------------------